Retrieval of categorized items increases without guessing
نویسندگان
چکیده
منابع مشابه
Assigning indivisible and categorized items
In this paper, we study the problem of assigning indivisible items under the following constraints: 1) each item belongs to one of the p categories, 2) each agent is required to get exactly one item from each category, 3) no free disposal, and 4) no monetary transfer. We first characterize serial dictatorships by a minimal set of 3 properties: strategy-proofness, non-bossiness, and categorywise...
متن کاملX Allocating Indivisible Items in Categorized Domains
To overcome the communicational and computational barriers in allocation problems of indivisible items, we propose a novel and general class of allocation problems called categorized domain allocation problems (CDAPs), where the indivisible items are partitioned into multiple categories and we must allocate the items to the agents without monetary transfer, such that each agent gets at least on...
متن کاملAllocating Indivisible Items in Categorized Domains
We initiate a research agenda of mechanism design for categorized domain allocation problems (CDAPs), where indivisible items from multiple categories are allocated to agents without monetary transfer and each agent gets at least one item per category. We focus on basic CDAPs, where each agent gets exactly one item per category. We first characterize serial dictatorships by a minimal set of thr...
متن کاملA Allocating Indivisible Items in Categorized Domains
We formulate a general class of allocation problems called categorized domain allocation problems (CDAPs), where indivisible items from multiple categories are allocated to agents without monetary transfer and each agent gets at least one item per category. We focus on basic CDAPs, where the number of items in each category is equal to the number of agents. We characterize serial dictatorships ...
متن کاملA Fast Recommender System for Cold User Using Categorized Items
In recent years, recommender systems (RS) provide a considerable progress to users. RSs reduce the cost of a user’s time in order to reach to desired results faster. The main issue of RSs is the presence of cold users which are less active and their preferences are more difficult to detect. The aim of this study is to provide a new way to improve recall and precision in recommender systems for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Psychonomic Society
سال: 1975
ISSN: 0090-5054
DOI: 10.3758/bf03336709